By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Matrix Analysis and Applications

Table of Contents
Search This Issue
Volume 7, Issue 1, pp. 1-166

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Bicycles and Spanning Trees

Kenneth A. Berman

pp. 1-12

BibTeX  Abstract Full Text:  PDF

Telephone Problems with Failures

Kenneth A. Berman and Michael Hawrylycz

pp. 13-17

BibTeX  Abstract Full Text:  PDF

Adjacency Matrices

Colin D. Walter

pp. 18-29

BibTeX  Abstract Full Text:  PDF

Updating $LU$ Factorizations for Computing Stationary Distributions

R. E. Funderlic and R. J. Plemmons

pp. 30-42

BibTeX  Abstract Full Text:  PDF

The Geometry of $m$-Sequences: Three-Valued Crosscorrelations and Quadrics in Finite Projective Geometry

Richard A. Games

pp. 43-52

BibTeX  Abstract Full Text:  PDF

On the Number of Real Quadratic Factors of Polynomials

Zalman Rubinstein

pp. 53-59

BibTeX  Abstract Full Text:  PDF

Labelled Graphs with Small Vertex Degrees and $P$-Recursiveness

I. P. Goulden and D. M. Jackson

pp. 60-66

BibTeX  Abstract Full Text:  PDF

An Analogue of the Shannon Capacity of a Graph

Martin Farber

pp. 67-72

BibTeX  Abstract Full Text:  PDF

Probabilities for Intersecting Systems and Random Subsets of Finite Sets

P. C. Fishburn, P. Frankl, D. Freed, J. C. Lagarias, and A. M. Odlyzko

pp. 73-79

BibTeX  Abstract Full Text:  PDF

On the Reduction of a Matrix to Triangular or Diagonal Form by Consimilarity

Yoo Pyo Hong and Roger A. Horn

pp. 80-88

BibTeX  Abstract Full Text:  PDF

Super Line-Connectivity Properties of Circulant Graphs

F. T. Boesch and J. F. Wang

pp. 89-98

BibTeX  Abstract Full Text:  PDF

Vector Computations for Sparse Linear Systems

David R. Kincaid, Thomas C. Oppe, and David M. Young

pp. 99-112

BibTeX  Abstract Full Text:  PDF

A Generalized Parity Function and Its Use in the Construction of Perfect Codes

M. Mollard

pp. 113-115

BibTeX  Abstract Full Text:  PDF

The Characters of the Infinite Symmetric Group and Probability Properties of the Robinson–Schensted–Knuth Algorithm

Sergei V. Kerov and Anatol M. Vershik

pp. 116-124

BibTeX  Abstract Full Text:  PDF

The Number of Maximal Independent Sets in a Tree

Herbert S. Wilf

pp. 125-130

BibTeX  Abstract Full Text:  PDF

Efficient Vertex- and Edge-Coloring of Outerplanar Graphs

Andrzej Proskurowski and Maciej M. Syslo

pp. 131-136

BibTeX  Abstract Full Text:  PDF

Parallel Algorithms for Nonlinear Problems

R. E. White

pp. 137-149

BibTeX  Abstract Full Text:  PDF

Balloting Labelling and Personnel Assignment

W. D. Wei, Y. Z. Cai, C. L. Liu, and A. M. Odlyzko

pp. 150-158

BibTeX  Abstract Full Text:  PDF

Generalized Binary Binomial Group Testing

Nader Mehravari

pp. 159-166

BibTeX  Abstract Full Text:  PDF